26 research outputs found
La notion de consentement et la question du lien dâautoritĂ© dans les relations intimes en milieu universitaire
Le consentement est au deÌpart une notion juridique permettant de marquer la distinction entre des actions jugeÌes acceptables sur le plan normatif et dâautres qui ne le sont pas. Aujourd'hui, cette notion gagne l'espace public. ConseÌcutivement aÌ la loi 151, lâUniversiteÌ de Sherbrooke est en phase de reÌdaction dâun code de conduite pour la preÌvention des violences aÌ caracteÌre sexuel. Les juristes prennent conscience que sanctionner est insuffisant, quâil faut dâautres types de mesures accompagnant le Code criminel et donc une interrogation sur les normes. Le code de conduite devrait preÌvoir le cas ouÌ une personne ayant une relation peÌdagogique ou dâautoriteÌ avec un eÌtudiant entretient des liens intimes avec celui-ci. Les contours de la deÌfinition du consentement sont relativement mal cerneÌs par la population sondeÌe. Les efforts de preÌvention seraient peut-eÌtre insuffisants ou mal calibreÌs, car lâenqueÌte ne deÌnote pas dâune nette normalisation de la conscience du possible lien de subordination (qui rappelons-le invalide le consentement). Il reste aÌ eÌvaluer si un encadrement des relations dâautoriteÌ au sein de la population universitaire produirait un changement des comportements, et aÌ deÌfinir quels seraient les criteÌres pour mesurer les effets de lâadoption dâun code de conduite aÌ lâuniversiteÌ
Pourquoi le papier est-il toujours utilisĂ© dans les communications des organismes culturels ? Lâexemple des compagnies du CASJB Ă Sherbrooke
Pourquoi aimons-nous le papier ? Pourquoi aime-t-on sâafficherâ? Lâaffichage numĂ©rique est tout autour de nous (tĂ©lĂ©phone, tablette, Ă©cran). Pourtant, pourrait-on imaginer une organisation culturelle renoncer au papier pour annoncer un spectacle ? Ă lâaune de lâomniprĂ©sence des nouveaux mĂ©dias et de la diffusion massive des contenus culturels en ligne, nous nous interrogeons sur lâintĂ©rĂȘt pour une compagnie de spectacle de recourir aux imprimĂ©s.
Notre programme de recherche sâinscrit dans le domaine de la microsociologie en Ă©tudiant un objet banal, quotidien, lâimprimĂ©. Ainsi, notre travail de recherche empirique sâinspire de lâethnographie de la communication. Une enquĂȘte de terrain a Ă©tĂ© conduite pour comprendre les raisons de la persistance des affiches de spectacle en examinant les pratiques communicationnelles de cinq compagnies des arts de la scĂšne Ă Sherbrooke. Nous avons poursuivi une dĂ©marche de collecte de donnĂ©es de type qualitative auprĂšs des acteurs reprĂ©sentatifs de ce milieu (directrices artistiques, chargĂ©es de communication, graphistesâŠ) en menant des entretiens de type comprĂ©hensif, retranscrits et assemblĂ©s en un corpus. Nous avons analysĂ© la maniĂšre dont ces organisations dĂ©cident dâavoir recours ou non Ă lâimprimĂ©. Nous avons ensuite cherchĂ© Ă dĂ©terminer lâefficacitĂ© de ce moyen de communication.
LâĂ©tude a rĂ©vĂ©lĂ© quâau-delĂ dâun souci dâefficacitĂ© de lâimprimĂ©, sâexprimait chez les personnes interrogĂ©es un attachement singulier au papier. Ce mĂ©dium semble crĂ©er un lien affectif : Ă lâimage de la pochette dâun disque vinyle, il pourrait matĂ©rialiser un sentiment dâappartenance. En dĂ©finissant la notion de culture du papier, au regard des pratiques observĂ©es, nous dĂ©crirons ensuite en quoi lâusage de lâimprimĂ© pourrait relever dâune fonction patrimoniale
Solving Static Permutation Mastermind using Queries
Permutation Mastermind is a version of the classical mastermind game in which
the number of positions is equal to the number of colors , and
repetition of colors is not allowed, neither in the codeword nor in the
queries. In this paper we solve the main open question from Glazik, J\"ager,
Schiemann and Srivastav (2021), who asked whether their bound of
for the static version can be improved to , which would be best
possible. By using a simple probabilistic argument we show that this is indeed
the case.Comment: 6 page
Self-adjusting Population Sizes for the -EA on Monotone Functions
We study the -EA with mutation rate for , where
the population size is adaptively controlled with the -success rule.
Recently, Hevia Fajardo and Sudholt have shown that this setup with is
efficient on \onemax for , but inefficient if . Surprisingly,
the hardest part is not close to the optimum, but rather at linear distance. We
show that this behavior is not specific to \onemax. If is small, then the
algorithm is efficient on all monotone functions, and if is large, then it
needs superpolynomial time on all monotone functions. In the former case, for
we show a upper bound for the number of generations and for the number of function evaluations, and for we show
generations and evaluations. We also show formally that
optimization is always fast, regardless of , if the algorithm starts in
proximity of the optimum. All results also hold in a dynamic environment where
the fitness function changes in each generation
Hardest Monotone Functions for Evolutionary Algorithms
The study of hardest and easiest fitness landscapes is an active area of
research. Recently, Kaufmann, Larcher, Lengler and Zou conjectured that for the
self-adjusting -EA, Adversarial Dynamic BinVal (ADBV) is the
hardest dynamic monotone function to optimize. We introduce the function
Switching Dynamic BinVal (SDBV) which coincides with ADBV whenever the number
of remaining zeros in the search point is strictly less than , where
denotes the dimension of the search space. We show, using a combinatorial
argument, that for the -EA with any mutation rate , SDBV is
drift-minimizing among the class of dynamic monotone functions. Our
construction provides the first explicit example of an instance of the
partially-ordered evolutionary algorithm (PO-EA) model with parameterized
pessimism introduced by Colin, Doerr and F\'erey, building on work of Jansen.
We further show that the -EA optimizes SDBV in
generations. Our simulations demonstrate matching runtimes for both static and
self-adjusting and -EA. We further show, using an
example of fixed dimension, that drift-minimization does not equal maximal
runtime
Gated recurrent neural networks discover attention
Recent architectural developments have enabled recurrent neural networks
(RNNs) to reach and even surpass the performance of Transformers on certain
sequence modeling tasks. These modern RNNs feature a prominent design pattern:
linear recurrent layers interconnected by feedforward paths with multiplicative
gating. Here, we show how RNNs equipped with these two design elements can
exactly implement (linear) self-attention, the main building block of
Transformers. By reverse-engineering a set of trained RNNs, we find that
gradient descent in practice discovers our construction. In particular, we
examine RNNs trained to solve simple in-context learning tasks on which
Transformers are known to excel and find that gradient descent instills in our
RNNs the same attention-based in-context learning algorithm used by
Transformers. Our findings highlight the importance of multiplicative
interactions in neural networks and suggest that certain RNNs might be
unexpectedly implementing attention under the hood